Contour detection with bicubic spline surfaces

Fairing Bicubic B-Spline Surfaces using Simulated Annealing

In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smoothes the surface. The simulated-annealing search strategy is used to search for the global minimum of the fairing measure.

Minimal bi-6 G2 completion of bicubic spline surfaces

This paper addresses a gap in the arsenal of curvature continuous tensor-product spline constructions: an algorithm is provided to fill n-sided holes in C bi-3 spline surfaces using n patches of degree bi-6. Numerous experiments illustrate good highlight line and curvature distribution on the resulting surfaces.

Approximating catmull-clark subdivision surfaces with bicubic patches

Multi-scale B-spline Snakes for General Contour Detection

Traditional snakes suffer from slow convergence speed (many control points) and difficult to adjust weighting factors for internal energy terms. We propose an alternative formulation using cubic B-splines, where the knot spacing is variable and controlled by the user. A larger knot spacing allows to reduce the number of parameters, which increases optimization speeds. It also eliminates the nee...

B-spline snakes: a flexible tool for parametric contour detection

We present a novel formulation for B-spline snakes that can be used as a tool for fast and intuitive contour outlining. We start with a theoretical argument in favor of splines in the traditional formulation by showing that the optimal, curvature-constrained snake is a cubic spline, irrespective of the form of the external energy field. Unfortunately, such regularized snakes suffer from slow co...